Note on Eulerean squares
نویسندگان
چکیده
منابع مشابه
A note on completing latin squares
We give a condition on the spatial distribution of filled cells in a partial Latin square P that is sufficient to ensure completability, regardless of what symbols are used in the filled cells. For example, if P is of the order mr + t, where m, r are positive integers and t ≥ 0, m is odd, and the filled cells of P are contained in the first m+1 2 r × r subsquares along the main diagonal, our co...
متن کاملA note on sparse least-squares regression
We compute a sparse solution to the classical least-squares problem minx ‖Ax−b‖2, where A is an arbitrary matrix. We describe a novel algorithm for this sparse least-squares problem. The algorithm operates as follows: first, it selects columns from A, and then solves a least-squares problem only with the selected columns. The column selection algorithm that we use is known to perform well for t...
متن کاملA note on the least squares fitting of ellipses
Rosin, P.L., A note on the least squares fitting of ellipses, Pattern Recognition Letters 14 (1993) 799-808. The characteristics of two normalisations for the general conic equation are investigated for use in least squares fitting: either setting F = 1 or A + C= 1. The normalisations vary in three main areas: curvature bias, singularities, transformational invariance. It is shown that setting ...
متن کاملA note on the scaled total least squares problem
In this note, we present two results on the scaled total least squares problem. First, we discuss the relation between the scaled total least squares and the least squares problems. We derive an upper bound for the difference between the scaled total least squares solution and the least squares solution and establish a quantitative relation between the scaled total least squares residual and th...
متن کاملA note on privacy preserving iteratively reweighted least squares
Iteratively reweighted least squares (IRLS) is a widely-used method in machine learning to estimate the parameters in the generalised linear models. In particular, IRLS for L1 minimisation under the linear model provides a closed-form solution in each step, which is a simple multiplication between the inverse of the weighted second moment matrix and the weighted first moment vector. When dealin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences
سال: 1946
ISSN: 0386-2194
DOI: 10.3792/pja/1195572310